A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
نویسندگان
چکیده
منابع مشابه
A polynomial-time algorithm for a class of minimum concave cost flow problems
We study the minimum concave cost flow problem over a two-dimensional grid network (CFG), where one dimension represents time (1 ≤ t ≤ T ) and the other dimension represents echelons (1 ≤ l ≤ L). The concave function over each arc is given by a value oracle. We give a polynomial-time algorithm for finding the optimal solution when the network has a fixed number of echelons and all sources lie a...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملInterior Methods for Nonlinear Minimum Cost Network Flow Problems
INTERIOR METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS Ryuji Katsura Japan Medical Supply Co., Ltd. Masao Fukushima Kyoto University Toshihide lbaraki Kyoto University (Received March 24,1988; Revised August 5, 1988) In this paper we propose practical algorithms for solving the nonlinear minimum cost network flow problem which has many fields of application such as production-distrib...
متن کاملPolynomial Time Interior Point Algorithms for Transportation Problems
This paper deals with the Hitchcock transportation problem with m supply points and n demand points. Assume that m ~ n and all the data are positive integers which are less than or equal to an integer M. We propose two polynomial time algorithms for solving the problems. The algorithms are based on the interior point algorithms for solving general linear programming problems. Using some feature...
متن کاملA Faster Strongly Polynomial Minimum Cost Flow Algorithm
In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n (m + n log n)) time. Using a standard transformation, thjis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1990
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.33.157